منابع مشابه
Shortest Path Problem under Intuitionistic Fuzzy Setting
Biswas, S. S. , Alam, B. , Doja, M. N. 2013. An algorithm for extracting intuitionistic fuzzy shortest path in a graph. Applied Computational Intelligence and Soft Computing, 17. Dubois, D. and Prade, H. 1980. Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York. De, P. K. and Das, D. 2012 Ranking of trapezoidal intuitionistic fuzzy numbers, Intelligent Systems Design and A...
متن کاملShortest Path Problem under Bipolar Neutrosphic Setting
This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers. Finally, a numerical example has been provided for illustrating the proposed approach. Introduction Smarandache [1, 2] introduced neutrosophic set and neutrosophic logic by considering the nonstandard analysis. The c...
متن کاملThe Shortest Path Problem Under Partial Monitoring
The on-line shortest path problem is considered under partial monitoring scenarios. At each round, a decision maker has to choose a path between two distinguished vertices of a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way such that the loss of the chosen path (defined as the sum of the weights of its composing edges) be small. In the multi-arme...
متن کاملShortest Path Problem Under Trapezoidal Neutrosophic Information
In this study, we propose an approach to determine the shortest path length between a pair of specified nodes s and t on a network whose edge weights are represented by trapezoidal neutrosophic numbers. Finally, an illustrative example is provided to show the applicability and effectiveness of the proposed approach. Keywords—trapezoidal fuzzy neutrosophic sets; score function; Shortest path pro...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering & Management
سال: 2014
ISSN: 2169-0316
DOI: 10.4172/2169-0316.1000129